On Flag Vectors, the Dowling Lattice, and Braid Arrangements
نویسندگان
چکیده
We study complex hyperplane arrangements whose intersection lattices, known as the Dowling lattices, are a natural generalization of the partition lattice. We give a combinatorial description of the Dowling lattice via enriched partitions to obtain an explicit EL-labeling and then find a recursion for the flag h-vector in terms of weighted derivations. When the hyperplane arrangements are real they correspond to the braid arrangements An and Bn . By applying a result due to Billera and the authors, we obtain a recursive formula for the cd-index of the lattice of regions of the braid arrangements An and Bn .
منابع مشابه
The cd-index of zonotopes and arrangements
We investigate a special class of polytopes, the zonotopes, and show that their flag f -vectors satisfy only the affine relations fulfilled by flag f -vectors of all polytopes. In addition, we determine the lattice spanned by flag f -vectors of zonotopes. By duality, these results apply as well to the flag f -vectors of central arrangements of hyperplanes.
متن کاملInequalities for the H- and Flag H-vectors of Geometric Lattices
We prove that the order complex of a geometric lattice has a convex ear decomposition. As a consequence, if ∆(L) is the order complex of a rank (r+1) geometric lattice L, then the for all i ≤ r/2 the h-vector of ∆(L) satisfies, hi−1 ≤ hi and hi ≤ hr−i. We also obtain several inequalities for the flag h-vector of ∆(L) by analyzing the weak Bruhat order of the symmetric group. As an application, ...
متن کاملThe Dowling Transform of Subspace Arrangements
We define the Dowling transform of a real frame arrangement and show how the characteristic polynomial changes under this transformation. As a special case, the Dowling transform sends the braid arrangement An to the Dowling arrangement. Using Zaslavsky's characterization of supersolvability of signed graphs, we show supersolvability of an arrangement is preserved under the Dowling transform. W...
متن کاملOn Valuations, the Characteristic Polynomial, and Complex Subspace Arrangements
We present a new combinatorial method to determine the characteristic polynomial of any subspace arrangement that is defined over an infinite field, generalizing the work of Blass and Sagan. Our methods stem from the theory of valuations and Groemer's integral theorem. As a corollary of our main theorem, we obtain a result of Zaslavsky about the number of chambers of a real hyperplane arrangeme...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS On Computation of the Characteristic Polynomials of the Discriminantal Arrangements and the Arrangements Generated by Generic Points
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 21 شماره
صفحات -
تاریخ انتشار 1999